Multidimensional linear distinguishing attacks and Boolean functions
نویسندگان
چکیده
منابع مشابه
Distinguishing Attacks on T-Functions
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function and a previously unbroken multi-word T-function with a 256-bit state, we describe an efficient distinguishing attack having a 2 data complexity. Furthermore, Hong et al. recently proposed two fully specified stream ciph...
متن کاملAlgebraic Attacks and Decomposition of Boolean Functions
Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found. Low degree relations have been shown to exist for several well known constructions of stream ciphers immune to al...
متن کاملLinear symmetries of Boolean functions
In this note we study the linear symmetry group LS(f ) of a Boolean function f of n variables, that is, the set of all ∈ GLn(2) which leave f invariant, where GLn(2) is the general linear group on the field of two elements. The main problem is that of concrete representation: which subgroups G of GLn(2) can be represented as G= LS(f ) for some n-ary k-valued Boolean function f. We call such sub...
متن کاملVectorial Boolean functions and linear codes in the context of algebraic attacks
In this paper we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain 2n-ary cyclic codes (which we prove that they are LCD codes) extending results due to Rønjom and Helleseth. The knowledge of the minimum distance of thos...
متن کاملDistinguishing Properties of Higher Order Derivatives of Boolean Functions
Higher order differential cryptanalysis is based on the property of higher order derivatives of Boolean functions that the degree of a Boolean function can be reduced by at least 1 by taking a derivative on the function at any point. We define fast point as the point at which the degree can be reduced by at least 2. In this paper, we show that the fast points of a n-variable Boolean function fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2011
ISSN: 1936-2447,1936-2455
DOI: 10.1007/s12095-011-0053-3